Generative Probability Density Model in the Self-Organizing Map
نویسندگان
چکیده
The Self-Organizing Map, SOM, is a widely used tool in exploratory data analysis. A theoretical and practical challenge in the SOM has been the diffi culty to treat the method as a statistical model fitting procedure. In this chapter we give a short review of statistical approaches for the SOM. Then we present the probability density model for which the SOM training gives the maximum likeli hood estimate. The density model can be used to choose the neighborhood width of the SOM so as to avoid overfitting and to improve the reliability of the results. The density model also gives tools for systematic analysis of the SOM. A major ap plication of the SOM is the analysis of dependencies between variables. We discuss some difficulties in the visual analysis of the SOM and demonstrate how quanti tative analysis of the dependencies can be carried out by calculating conditional distributions from the density model.
منابع مشابه
On the generative probability density model in the self-organizing map
The Self-Organizing Map, SOM, is a widely used tool in exploratory data analysis. A major drawback of the SOM has been the lack of a theoretically justified criterion for model selection. Model complexity has a decisive effect on the reliability of visual data analysis, which is a main application of the SOM. In particular, independence of variables cannot be observed unless generalization of t...
متن کاملGtm: a Principled Alternative to the Self-organizing Map Gtm: a Principled Alternative to the Self-organizing Map 2
The Self-Organizing Map (SOM) algorithm has been extensively studied and has been applied with considerable success to a wide variety of problems. However, the algorithm is derived from heuristic ideas and this leads to a number of signiicant limitations. In this paper, we consider the problem of modelling the probability density of data in a space of several dimensions in terms of a smaller nu...
متن کاملGTM: A Principled Alternative to the Self-Organizing Map
The Self-Organizing Map (SOM) algorithm has been extensively studied and has been applied with considerable success to a wide variety of problems. However, the algorithm is derived from heuristic ideas and this leads to a number of significant limitations. In this paper, we consider the problem of modelling the probability density of data in a space of several dimensions in terms of a smaller n...
متن کاملGTM: The Generative Topographic Mapping
Latent variable models represent the probability density of data in a space of several dimensions in terms of a smaller number of latent, or hidden, variables. A familiar example is factor analysis, which is based on a linear transformation between the latent space and the data space. In this article, we introduce a form of nonlinear latent variable model called the generative topographic mappi...
متن کاملUsing Smoothed Data Histograms for Cluster Visualization in Self-Organizing Maps
Several methods to visualize clusters in high-dimensional data sets using the Self-Organizing Map (SOM) have been proposed. However, most of these methods only focus on the information extracted from the model vectors of the SOM. This paper introduces a novel method to visualize the clusters of a SOM based on smoothed data histograms. The method is illustrated using a simple 2-dimensional data ...
متن کامل